From discrete to continuous variational problems: an introduction
نویسنده
چکیده
where the sum is performed for k ∈ Z and on indices i ∈ Z such that iε ∈ Ω and (i+ k)ε ∈ Ω. If we picture the lattice εZ ∩ Ω as the reference configuration of a set of material points interacting through some forces, and ui represents the displacement of the i-th point, then ψ ε can be thought as the energy density of the interaction of points with distance kε in the reference lattice. Note that the only assumption we make is that ψ ε depends on {ui} through the differences ui+k−ui. It is usually more convenient to make change in the notation and set φε(z) = ε −Nψj ε(jεz); In such a way we write
منابع مشابه
Pseudoconvex Multiobjective Continuous-time Problems and Vector Variational Inequalities
In this paper, the concept of pseudoconvexity and quasiconvexity for continuous~-time functions are studied and an equivalence condition for pseudoconvexity is obtained. Moreover, under pseudoconvexity assumptions, some relationships between Minty and Stampacchia vector variational inequalities and continuous-time programming problems are presented. Finally, some characterizations of the soluti...
متن کاملStrong convergence of a general implicit algorithm for variational inequality problems and equilibrium problems and a continuous representation of nonexpansive mappings
We introduce a general implicit algorithm for finding a common element of the set of solutions of systems of equilibrium problems and the set of common fixed points of a sequence of nonexpansive mappings and a continuous representation of nonexpansive mappings. Then we prove the strong convergence of the proposed implicit scheme to the unique solution of the minimization problem on the so...
متن کاملA Discrete Global Minimization Algorithm for Continuous Variational Problems
In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planar-graph shortest path problem.
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملDISCRETE SIZE AND DISCRETE-CONTINUOUS CONFIGURATION OPTIMIZATION METHODS FOR TRUSS STRUCTURES USING THE HARMONY SEARCH ALGORITHM
Many methods have been developed for structural size and configuration optimization in which cross-sectional areas are usually assumed to be continuous. In most practical structural engineering design problems, however, the design variables are discrete. This paper proposes two efficient structural optimization methods based on the harmony search (HS) heuristic algorithm that treat both discret...
متن کامل